package jianzhiOffer;

public class num53_1 {
    public int search(int[] nums, int target) {
        int count = 0;
        for(int i = 0;i < nums.length;i ++) {
            if(nums[i] > target) break;
            if(nums[i] == target) count ++;
        }
        return count;

    }
}
